Domain decomposition algorithms for fourth-order nonlinear elliptic eigenvalue problems
نویسندگان
چکیده
We study domain decomposition methods for fourth-order plate problems. The well-known von K arm an equations are used as our model problem. By exploiting the symmetry of the domain, the solution of the original problem can be obtained by solving those associated reduced problems, which are defined on subdomains with appropriate boundary conditions. We show how nonoverlapping and overlapping domain decomposition methods can be used to solve the reduced problems. For the linearized von K arm an equation, we present preconditioners using both Fourier analysis and probing techniques for the interface systems, which are similar to those derived by Chan et al. Finally, we compare the efficiency of various domain decomposition preconditioners for solving the von K arm an equations. 2003 Elsevier B.V. All rights reserved. AMS: 65N55; 65N06; 73H05; 65F10
منابع مشابه
Sign-preserving Property for Some Fourth-order Elliptic Operators in One Dimension and Radial Symmetry
For a class of one-dimensional linear elliptic fourth-order equations with homogeneous Dirichlet boundary conditions it is shown that a non-positive and non-vanishing right-hand side gives rise to a negative solution. A similar result is obtained for the same class of equations for radially symmetric solutions in a ball or in an annulus. Several applications are given, including applications to...
متن کاملContemporary Mathematics Volume Domain Decomposition Methods for Monotone Nonlinear Elliptic Problems
In this paper we study several overlapping domain decompo sition based iterative algorithms for the numerical solution of some non linear strongly elliptic equations discretized by the nite element methods In particular we consider additive Schwarz algorithms used together with the classical inexact Newton methods We show that the algorithms con verge and the convergence rates are independent o...
متن کاملApplications of a Space Decomposition Method to Linear and Nonlinear Elliptic Problems
This work presents some space decomposition algorithms for a convex minimization problem. The algorithms has linear rate of convergence and the rate of convergence depends only on four constants. The space decomposition could be a multigrid or domain decomposition method. We explain the detailed procedure to implement our algorithms for a two-level overlapping domain decomposition method and es...
متن کاملOn a parallel Maxwell eigensolver
Fast domain decomposition solver for internal problems of 3D hierarchical hp-FEM I. Anoufriev, V. Korneev Deriving fast domain decomposition (DD) preconditioners-solvers for hp discretizations of 2-nd order elliptic equations is still a challenge [1], although one pioneering solver of this type has been recently presented in [2] and generalized on adaptive hp discretizations in [3]. As it is we...
متن کاملRate of Convergence for some constraint decomposition methods for nonlinear variational inequalities
Some general subspace correction algorithms are proposed for a convex optimization problem over a convex constraint subset. One of the nontrivial applications of the algorithms is the solving of some obstacle problems by multilevel domain decomposition and multigrid methods. For domain decomposition and multigrid methods, the rate of convergence for the algorithms for obstacle problems is of th...
متن کامل